Decidability for some justification logics with negative introspection

Decidability for some justification logics with negative introspection

Justification logics are modal logics that include justifications for the agent’s knowledge. So far, there are no decidability results available for justification logics with negative introspection. In this paper, we develop a novel model construction for such logics and show that justification logics with negative introspection are decidable for finite constant specifications. §

Decidability for Justification Logics Revisited

Justification logics are propositional modal-like logics that instead of statements A is known include statements of the form A is known for reason t where the term t can represent an informal justification for A or a formal proof of A. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in...

Justification Logics with Common Knowledge

Justification logics and hybrid logics

Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, w...

Decidability of Predicate Logics with Team Semantics

We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIMEcomplete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We also briefly analyse the complexity of...